A Calculus for Dynamic Linking
نویسندگان
چکیده
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notions of software configuration and execution, by introducing separate syntactic notions of linkset expression and command, respectively. A reduction step can be either a simplification of a linkset expression, or the execution of a command w.r.t. a specific underlying software configuration denoted by a linkset expression; because of dynamic linking, these two kinds of reductions are interleaved. The type system of the calculus, which is proved to be sound, relies on an accurate dependency analysis for ensuring type safety without losing the advantages offered by dynamic linking.
منابع مشابه
A Calculus for Dynamic Loading
We present the load-calculus, used to model dynamic loading, and prove it sound. The calculus extends the polymorphic λ-calculus with a load primitive that dynamically loads terms that are closed, with respect to values. The calculus is meant to approximate the process of dynamic loading in TAL/Load [4], an version of Typed Assembly Language [7] extending with dynamic linking. To model the key ...
متن کاملA Calculus for Compiling and Linking Classes
We describe a low-level calculus, called ink& (pronounced “links”), designed to serve as an intermediate representation in compilers for class-based objectoriented languages. The calculus fills two roles. First, its primitives can express a wide range of class-based object-oriented language features, such as class construction and various forms of method dispatch. Second, it allows the compiler...
متن کاملDynamic Reasoning without Variables Dynamic Reasoning without Variables
A variable free notation for dynamic logic is proposed which takes its cue from De Bruijn's variable free notation for lambda calculus. De Bruijn indexing replaces variables by indices which indicate the distance to their binders. We propose to use reverse De Bruijn indexing, which works almost the same, only now the indices refer to the depth of the binding operator in the formula. The resulti...
متن کاملUpdating Anaphoric Contexts
An incremental semantics for a logic with dynamic binding is developed on the basis of a variable free notation for dynamic logic that takes its cue from De Bruijn's variable free notation for lambda calculus. De Bruijn indexing replaces variables by indices which indicate the distance to their binders. We propose to use reverse De Bruijn indexing, which works almost the same, only now the indi...
متن کاملA CLOSED FORM SOLUTION FOR FREE VIBRATION ANALYSIS OF TUBE-IN-TUBE SYSTEMS IN TALL BUILDINGS
In this paper the dynamic response of tube-in-tube systems for tall building structures is investigated. Inner and outer tubes are modeled using equivalent continuous orthotropic membranes; in which, each tube is individually modeled by a cantilever box beam. By applying the compatibility conditions on deformation of the two tubes, the governing dynamic equations of the tube-in-tube structure a...
متن کامل